Tait′s Flyping Conjecture for Well-Connected Links
نویسندگان
چکیده
منابع مشابه
The Tait Flyping Conjecture
We announce a proof of the Tait flyping conjecture; the confirmation of this conjecture renders almost trivial the problem of deciding whether two given alternating link diagrams represent equivalent links. The proof of the conjecture also shows that alternating links have no "hidden" symmetries. In the nineteenth century, the celebrated physicist and knot tabulator P. G. Tait proposed the foll...
متن کاملTait's flyping conjecture for 4-regular graphs
Tait’s flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S. The proof of this version of the flyping conjecture is based on the fact that the equivalence classes with respect to ambient isotopy and rigid vertex isotopy of graph embeddings are i...
متن کاملConnected matchings and Hadwiger's conjecture
Conjecture 0.3 has a fairly interesting reformulation with some ”Ramsey flavor”. A set of pairwise disjoint edges e1, e2, . . . , et of G is called a connected matching of size t ([8]) if for every 1 ≤ i < j ≤ t there exists at least one edge of G connecting an endpoint of ei to an endpoint of ej . Alfréd Rényi Institute, Hungarian Academy of Sciences, Budapest 1364, P. O. Box 127 and Dept. of ...
متن کاملWell-Connected Relation Computer
In this paper we summarize recent database machine research activities at the University of Wisconsin, outline current research projects, and describe our future research plans.
متن کاملA Well-Connected Separator for Planar Graphs
We prove a separator theorem for planar graphs, which has been used to obtain polynomial time approximation schemes for the metric TSP [8] and the 2edge-connected and biconnected spanning subgraph problems [6] in unweighted planar graphs. We also prove an extension of the theorem which was used in [3] to find quasi-polynomial time approximation schemes for the weighted cases of the latter two p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1993
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1032